Advanced Optimization Laboratory Title: A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region
نویسندگان
چکیده
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2 − 2 “sharp” turns in dimension n. In all of the previous constructions, the maximum of the distances of the redundant constraints to the corresponding facets is an exponential number of the dimension n, and those distances are decaying geometrically. In this paper, we provide a new construction in which all of the distances are set to zero, i.e., all of the redundant constraints touch the feasible region.
منابع مشابه
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n − 2 sharp turns in dimension n. In those constructions the redundant hyperplanes were placed parallel with the facets active at the optimal solution. In this paper we present a simpler and more powerful construction, where the redundant...
متن کاملA redundant Klee-Minty construction with all the redundant constraints touching the feasible region
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2 − 2 “sharp” turns in dimension n. In all of the previous constructions, the maximum of the distances of the redundant constraints to the corresponding facets is an exponential number of the dimension n, and those distances are decaying geo...
متن کاملCentral Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes
We consider a family of linear optimization problems over the n-dimensional Klee—Minty cube and show that the central path may visit all of its vertices in the same order as simplex methods do. This is achieved by carefully adding an exponential number of redundant constraints that forces the central path to take at least 2 − 2 sharp turns. This fact suggests that any feasible path-following in...
متن کاملThe central path visits all the vertices of the Klee-Minty cube
Optimization Methods and Software Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713645924 The central path visits all the vertices of the Klee-Minty cube Antoine Deza a; Eissa Nematollahi a; Reza Peyghami a; Tamás Terlaky a a Advanced Optimization Laboratory, Department of Computing and Software, McMaster Un...
متن کاملA tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes
It is an open question whether there is an interior-point algorithm for linear optimization problems with a lower iteration-complexity than the classical bound O( √ n log(1 μ0 )). This paper provides a negative answer to that question for a variant of the Mizuno-Todd-Ye predictor-corrector algorithm. In fact, we prove that for any > 0, there is a redundant Klee-Minty cube for which the aforemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008